0.00/0.01	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.01	% app-encoded or not : original
0.00/0.01	% Variant    : supatvars_ext
0.00/0.01	% Ordering    : kbo
0.00/0.01	% Command    : 
0.00/0.01	#!/bin/sh
0.00/0.01	
0.00/0.01	./zipperposition.native ${1:+"$1"} \
0.00/0.01	  -i tptp \
0.00/0.01	  -o tptp \
0.00/0.01	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.01	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.01	  --no-avatar \
0.00/0.01	  --ho \
0.00/0.01	  --force-ho \
0.00/0.01	  --no-ho-elim-pred-var \
0.00/0.01	  --ho-general-ext-pos \
0.00/0.01	  --no-ho-unif \
0.00/0.01	  --no-induction \
0.00/0.01	  --no-unif-pattern \
0.00/0.01	  --ord $2  \
0.00/0.01	  --simultaneous-sup false \
0.00/0.01	  --sup-at-vars \
0.00/0.01	  --restrict-hidden-sup-at-vars \
0.00/0.01	  --ho-ext-axiom \
0.00/0.01	  --ho-prim-enum none \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --dont-select-ho-var-lits \
0.00/0.01	  --no-fool
0.00/0.21	% Computer   : n114.star.cs.uiowa.edu
0.00/0.21	% Model      : x86_64 x86_64
0.00/0.21	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.21	% Memory     : 32218.625MB
0.00/0.21	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.21	% CPULimit   : 300
0.00/0.21	% DateTime   : Fri Feb  2 18:32:39 CST 2018
0.00/0.22	% done 2 iterations in 0.004s
0.00/0.22	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.22	% SZS output start Refutation
0.00/0.22	tff('thm/sets/INSERT_AC_1', conjecture,
0.00/0.22	  (![A:$tType,A0:A,A1:(A > $o)]:
0.00/0.22	     ('const/sets/INSERT'(A,A0,'const/sets/INSERT'(A,A0,A1)) =
0.00/0.22	      'const/sets/INSERT'(A,A0,A1)))).
0.00/0.22	tff(zf_stmt_0, negated_conjecture,
0.00/0.22	  (~
0.00/0.22	    (![A:$tType,A0:A,A1:(A > $o)]:
0.00/0.22	       ('const/sets/INSERT'(A,A0,'const/sets/INSERT'(A,A0,A1)) =
0.00/0.22	        'const/sets/INSERT'(A,A0,A1))))).
0.00/0.22	tff('0', plain,
0.00/0.22	    'const/sets/INSERT'(sk_A, sk_A0, 'const/sets/INSERT'(sk_A, sk_A0, sk_A1))
0.00/0.22	     != 'const/sets/INSERT'(sk_A, sk_A0, sk_A1),
0.00/0.22	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('1', plain,
0.00/0.22	    'const/sets/INSERT'(sk_A, sk_A0, 
0.00/0.22	      'const/sets/INSERT'(sk_A, sk_A0, sk_A1), '#k1')
0.00/0.22	     != 'const/sets/INSERT'(sk_A, sk_A0, sk_A1, '#k1'),
0.00/0.22	    inference('rw_lit', [status(thm)], ['0'])).
0.00/0.22	tff('thm/sets/INSERT_INSERT_', axiom,
0.00/0.22	  (![A:$tType,A0:A,A1:(A > $o)]:
0.00/0.22	     ('const/sets/INSERT'(A,A0,'const/sets/INSERT'(A,A0,A1)) =
0.00/0.22	      'const/sets/INSERT'(A,A0,A1)))).
0.00/0.22	tff('2', plain,
0.00/0.22	    ![X0 : $tType, X1 : X0, X2 : X0 > $o]:
0.00/0.22	      'const/sets/INSERT'(X0, X1, 'const/sets/INSERT'(X0, X1, X2))
0.00/0.22	       = 'const/sets/INSERT'(X0, X1, X2),
0.00/0.22	    inference('cnf', [status(esa)], [thm/sets/INSERT_INSERT_])).
0.00/0.22	tff('3', plain,
0.00/0.22	    ![X0 : $tType, X1 : X0, X2 : X0 > $o, X3 : X0]:
0.00/0.22	      'const/sets/INSERT'(X0, X1, 'const/sets/INSERT'(X0, X1, X2), X3)
0.00/0.22	       = 'const/sets/INSERT'(X0, X1, X2, X3),
0.00/0.22	    inference('ho_complete_eq', [status(thm)], ['2'])).
0.00/0.22	tff('4', plain,
0.00/0.22	    'const/sets/INSERT'(sk_A, sk_A0, sk_A1, '#k1')
0.00/0.22	     != 'const/sets/INSERT'(sk_A, sk_A0, sk_A1, '#k1'),
0.00/0.22	    inference('demod', [status(thm)], ['1', '3'])).
0.00/0.22	tff('5', plain, $false, inference('simplify', [status(thm)], ['4'])).
0.00/0.22	
0.00/0.22	% SZS output end Refutation
0.00/0.22	EOF
